Analysis of an Infinite-Server Queue with Batch Markovian Arrival Streams
نویسندگان
چکیده
This paper considers an infinite-server queue with multiple batch Markovian arrival streams. The service time distribution of customers may be different for different arrival streams, and simultaneous batch arrivals from more than one stream are allowed. For this queue, we first derive a system of ordinary differential equations for the time-dependent matrix joint generating function of the number of customers in the system. Next assuming phase-type service times, we derive explicit and numerically feasible formulas for the time-dependent and limiting joint binomial moments. Further some numerical examples are provided to discuss the impact of system parameters on the performance.
منابع مشابه
Stationary Queue Length in a Fifo Single Server Queue with Service Interruptions and Multiple Batch Markovian Arrival Streams
Abstract This paper considers a FIFO single-server queue with service interruptions and multiple batch Markovian arrival streams. The server state (on and off), the type of arriving customers and their batch size are assumed to be governed by a continuous-time Markov chain with finite states. To put it more concretely, the marginal process of the server state is a phase-type alternating Markov ...
متن کاملAnalyses of a Markovian queue with two heterogeneous servers and working vacation
This paper analyzes an M/M/2 queueing system with two heterogeneous servers. Both servers goes on vacation when there is no customers waiting for service after this server 1 is always available but the other goes on vacation whenever server 2 is idle. The vacationing server however, returns to serve at a low rate as an arrival finds the other server busy. The system is analyzed in the steady st...
متن کاملMatrix Product-Form Solutions for LCFS Preemptive Service Single-Server Queues with Batch Markovian Arrival Streams
This paper considers three variants of last-come first-served (LCFS) preemptive service single-server queues, where customers are served under the LCFS preemptive resume (LCFS-PR), preemptive repeat-different (LCFS-PD), and preemptive repeat-identical (LCFS-PI) disciplines, respectively. These LCFS queues are fed by multiple batch Markovian arrival streams. Service times of customers from each ...
متن کاملThe MM sum(k=1 to K of CPPk/GE/c/L) G-queue with heterogeneous servers: Steady state solution and an application to performance evaluation
A new queue, referred to here as the HetSigma queue, in the Markovian framework, is proposed in order to model nodes in modern telecommunication networks. The queue has many of the necessary ingredients, such as joint (or individual) Markov modulation of the arrival and service processes, superposition of K CPP (compound Poisson process) streams of (positive) customer arrivals, and a CPP of neg...
متن کاملFurther Transient Analysis of the BMAP/G/1 Queue
Previously, we derived the two-dimensional transforms of the emptiness function, the transient workload and queue-length distributions in the single-server queue with general service times and a batch Markovian arrival process (BMAP). This arrival process includes the familiar phase-type renewal process and the Markov modulated Poisson process as special cases, as well as superpositions of thes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Queueing Syst.
دوره 42 شماره
صفحات -
تاریخ انتشار 2002